Cybersecurity-Enhanced Encrypted Control System Using Keyed-Homomorphic Public Key Encryption

نویسندگان

چکیده

Encrypted control systems are secure methods that use the cryptographic properties of a specific homomorphic encryption scheme. This study proposes cyberattack-detectable encrypted system and validates its effectiveness using proportional integration derivative (PID) position-control for an industrial motor. The proposed uses keyed-homomorphic public-key scheme real-time detection cyberattacks, such as signal parameter falsification. Additionally, novel quantizer is presented to reduce computation cost quantization-error effects on performance. demonstrated significant improvement, reducing time by 47.3 % compared our previous quantizer, decreasing effect 30.6 widely-used gain-multiplying quantizer. Moreover, this establishes conditions through theorem avoid overflow in system. Experimental validation confirms effectively conceals operation, aids designing quantization gains prevent overflows. Notably, results falsification attack tests highlight enables attacked components within parameters signals, representing advantage study.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chosen Ciphertext Secure Keyed-Homomorphic Public-Key Encryption

In homomorphic encryption schemes, anyone can perform homomorphic operations, and therefore, it is difficult to manage when, where and by whom they are performed. In addition, the property that anyone can “freely” perform the operation inevitably means that ciphertexts are malleable, and it is well-known that adaptive chosen ciphertext (CCA) security and the homomorphic property can never be ac...

متن کامل

Processing Encrypted Data Using Homomorphic Encryption

Fully Homomorphic Encryption (FHE) was initially introduced as a concept shortly after the development of the RSA cryptosystem, by Rivest et al. [54]. Although long sought after, the first functional scheme was only proposed over thirty years later by Gentry [34, 35] in 2009. The same blueprint to construct FHE has been followed in all subsequent work. First a scheme is constructed which can ev...

متن کامل

Homomorphic Encryption: From Private-Key to Public-Key

We show how to transform any additively homomorphic privatekey encryption scheme that is compact, into a public-key encryption scheme. By compact we mean that the length of a homomorphically generated encryption is independent of the number of ciphertexts from which it was created. We do not require anything else on the distribution of homomorphically generated encryptions (in particular, we do...

متن کامل

Encrypted Receipts for Voter-verified Elections Using Homomorphic Encryption

Voters are now demanding the ability to verify that their votes are cast and counted as intended. Most existing cryptographic election protocols do not treat the voter as a computationally-limited entity separate from the voting booth, and therefore do not ensure that the voting booth records the correct vote. David Chaum and Andrew Neff have proposed mixnet schemes that do provide this assuran...

متن کامل

Fully Homomorphic Public-key Encryption Based on Discrete Logarithm Problem

In this paper I propose the new fully homomorphic public-key encryption scheme without bootstrapping that is based on the discrete logarithm assumption and computational Diffie–Hellman assumption of multivariate polynomials on octonion ring. The key size of this scheme and complexity for enciphering /deciphering become to be not so large to handle. keywords: fully homomorphic public-key encrypt...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3274691